Folding of Cantor String

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Folding of Cantor String

In recent years, folding of various objects have been generated using different approaches. The classical Cantor set is an interesting mathematical construction with links to several areas of analysis and topology. The purpose of this paper is to represent the folding of Cantor string (compliment of Cantor set) using direct folding and folding by cut methods. Moreover, the results governing the...

متن کامل

Nonarchimedean Cantor set and string

We construct a nonarchimedean (or p-adic) analogue of the classical ternary Cantor set C. In particular, we show that this nonarchimedean Cantor set C3 is self-similar. Furthermore, we characterize C3 as the subset of 3-adic integers whose elements contain only 0’s and 2’s in their 3-adic expansions and prove that C3 is naturally homeomorphic to C. Finally, from the point of view of the theory ...

متن کامل

New 5-adic Cantor sets and fractal string

In the year (1879-1884), George Cantor coined few problems and consequences in the field of set theory. One of them was the Cantor ternary set as a classical example of fractals. In this paper, 5-adic Cantor one-fifth set as an example of fractal string have been introduced. Moreover, the applications of 5-adic Cantor one-fifth set in string theory have also been studied.

متن کامل

On the Complexity of String Folding

A fold of a nite string S over a given alphabet is an embedding of S in some xed innnite grid, such as the square or cubic mesh. The score of a fold is the number of pairs of matching string symbols which are embedded at adjacent grid vertices. Folds of strings in two-and three-dimensional meshes are considered, and the corresponding problems of optimizing the score or achieving a given target ...

متن کامل

Approximation Algorithms for String Folding Problems

We present polynomial–time approximation algorithms for string folding problems over any finite alphabet. Our idea is the following: describe a class of feasible solutions by means of an ambiguous contextfree grammar (i.e. there is a bijection between the set of parse trees and a subset of possible embeddings of the string); give a score to every production of the grammar, so that the total sco...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: International Journal of Computer Applications

سال: 2016

ISSN: 0975-8887

DOI: 10.5120/ijca2016909381